Efficient query processing with structural join indexing in an object relational data warehousing environment
نویسندگان
چکیده
In an Object Relational Data Warehousing (ORDW) environment, the semantics of data and queries can be explicitly captured, represented, and utilized based on is-a and class composition hierarchies, thereby resulting in more efficient OLAP query processing. In this chapter, we show the efficacy in building semantic-rich hybrid data indexes incorporating Structural Join Index Hierarchy (SJIH) on the ORDW views. Given a set of queries, we use a hill-climbing heuristic algorithm to select (near) optimal SJIHs, thereby embedding query semantics into the indexing framework. Finally, by a cost model, we analyze the effectiveness of our approach vis-a-vis the pointer chasing approach.
منابع مشابه
Join Index Hierarchy: An Indexing Structure for Efficient Navigation in Object-Oriented Databases
A novel indexing structure, join index hierarchy, is proposed to handle the \goto's on disk" problem in object-oriented query processing. The method constructs a hierarchy of join indices and transforms a sequence of pointer chasing operations into a simple search in an appropriate join index le, and thus accelerates navigation in object-oriented databases. The method extends the join index str...
متن کاملEfficient query processing with associated horizontal class partitioning in an object relational data warehousing environment
In an Object Relational Data Warehousing (ORDW) environment, the semantics of data and queries can be explicitly captured, represented, and utilized based on is-a and class composition hierarchies, thereby resulting in more efficient OLAP query processing. In this paper, we show the efficacy in building semantic-rich hybrid class partitions by incorporating the Associated Horizontal Class Parti...
متن کاملSemantic Query Optimization based on Class Partitioning Techniques in an Object Relational Data Warehousing Environment*
The conventional star schema model of Data Warehouse (DW) has its limitations due to the nature of the relational data model. Firstly, this model cannot represent the semantics and operations of multi-dimensional data adequately. Due to the hidden semantics, it is difficult to efficiently address the problems of view design. Secondly, as we move up to higher levels of summary data (multiple com...
متن کاملPartJoin: An Efficient Storage and Query Execution for Data Warehouses
The performance of OLAP queries can be improved drastically if the warehouse data is properly selected and indexed. The problems of selecting and materializing views and indexing data have been studied extensively in the data warehousing environment. On the other hand, data partitioning can also greatly increase the performance of queries. Data partitioning has advantage over data selection and...
متن کاملEfficient Index-based Processing of Join Queries in DHTs
Massively distributed applications require the integration of heterogeneous data from multiple sources. Peer-to-peer (P2P) is one possible network model for these distributed applications and among P2P architectures, distributed hash table (DHT) is well known for its routing performance guarantees. Under a general distributed relational data model, join query operator, an essential component to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000